A Small Computer Model with Push-Down Stack
نویسنده
چکیده
The SCMFSA computer can prove the correctness of many algorithms. Unfortunately, it cannot prove the correctness of recursive algorithms. For this reason, this article improves the SCMFSA computer and presents a Small Computer Model with Push-Down Stack (called SCMPDS for short). In addition to conventional arithmetic and ”goto” instructions, we increase two new instructions such as ”return” and ”save instruction-counter” in order to be able to design recursive programs.
منابع مشابه
A Small Computer Model with Push-Down Stack1
The SCMFSA computer can prove the correctness of many algorithms. Unfortunately, it cannot prove the correctness of recursive algorithms. For this reason, this article improves the SCMFSA computer and presents a Small Computer Model with PushDown Stack (called SCMPDS for short). In addition to conventional arithmetic and ”goto” instructions, we increase two new instructions such as ”return” and...
متن کاملResource-Constrained Model Checking of Recursive Programs
A number of recent papers present efficient algorithms for LTL model checking for recursive programs with finite data structures. A common feature in all these works is that they consider infinitely long runs of the program without regard to the size of the program stack. Runs requiring unbounded stack are often a result of abstractions done to obtain a finite-data recursive program. In this pa...
متن کاملImplicit Acquisition of Grammars With Crossed and Nested Non-Adjacent Dependencies: Investigating the Push-Down Stack Model
A recent hypothesis in empirical brain research on language is that the fundamental difference between animal and human communication systems is captured by the distinction between finite-state and more complex phrase-structure grammars, such as context-free and context-sensitive grammars. However, the relevance of this distinction for the study of language as a neurobiological system has been ...
متن کاملUddén et al. Implicit Acquisition of Grammars with Non-Adjacent Dependencies 1 Accepted for publication in Cognitive Science IMPLICIT ACQUISITION OF GRAMMARS WITH CROSSED AND NESTED NON- ADJACENT DEPENDENCIES: INVESTIGATING THE PUSH-DOWN STACK MODEL
A recent hypothesis in empirical brain research on language is that the fundamental difference between animal and human communication systems is captured by the distinction between finitestate and more complex phrase-structure grammars, such as context-free and context-sensitive grammars. However, the relevance of this distinction for the study of language as a neurobiological system has been q...
متن کاملDesign of an optimal folding mechanism for Java processors
Java has become the most important language in the Internet area, but its execution performance is severely limited by the true data dependency inherited from the stack architecture defined by the Sun’s Java Virtual Machine (JVM). To enhance the performance of the JVM, a stack operations folding mechanism for the picoJava-II processor was proposed by Sun Microsystems to fold 42.3% stack push/po...
متن کامل